iNetwork A Framework for Network Optimisation

نویسندگان

  • Anthony Conway
  • Raphael Dorne
  • Chris Voudouris
چکیده

The use of heuristic search techniques for network optimisation problems has long been noted for its merits. It often requires both a significant understanding of both the heuristic methods themselves and the specific network problem domain. This precludes many network domain experts from effectively using heuristic search paradigms in building solutions. Solutions to network problems using heuristic methods generally involve significant development effort both to effectively drive the heuristic method and to model the domain requirements. Applying a different heuristic method to the same underlying problem often requires a major re-development of the original solution. The iNetwork framework presented in this paper provides a toolkit for the development of solutions to problems in network optimisation. iNetwork is an extension framework of the iOpt heuristic search toolkit and as such provides tools for modelling problems as invariant networks and the application of various heuristic search methods against those networks. iNetwork itself provides methods for specifying network problems in familiar network terms along with a broad base of algorithms that can be used in the formulation of solutions. Using a combination of adaptable network models, graph theory algorithms and heuristic based search algorithms, iNetwork provides a very flexible platform from which to develop solutions to network problems. The framework has initially been applied to the problem of Quality of Service routing. A short presentation of this work is given in the paper.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Emergency department resource optimisation for improved performance: a review

Emergency departments (EDs) have been becoming increasingly congested due to the combined impacts of growing demand, access block and increased clinical capability of the EDs. This congestion has known to have adverse impacts on the performance of the healthcare services. Attempts to overcome with this challenge have focussed largely on the demand management and the application of system wide p...

متن کامل

MultiPlane: a New Framework for Drawing Graphs in Three

This paper describes a new framework for drawing graphs in 2 1 2 dimensions. In general, the framework uses a divide and conquer approach. More specifically, the framework divides a graph into a set of smaller subgraphs, and then draws each subgraph in a 2D “plane” (a bounded planar region). Finally, a 2 1 2 drawing of the graph is constructed by these planes in 3D, satisfying optimisation crit...

متن کامل

Wireless Optimisation via Convex Bandits: Unlicensed LTE/WiFi Coexistence

Bandit Convex Optimisation (BCO) is a powerful framework for sequential decision-making in non-stationary and partially observable environments. In a BCO problem, a decisionmaker sequentially picks actions to minimize the cumulative cost associated with these decisions, all while receiving partial feedback about the state of the environment. This formulation is a very natural fit for wireless-n...

متن کامل

A new SDN-based framework for wireless local area networks

Nowadays wireless networks are becoming important in personal and public communication andgrowing very rapidly. Similarly, Software Dened Network (SDN) is an emerging approach to over-come challenges of traditional networks. In this paper, a new SDN-based framework is proposedto ne-grained control of 802.11 Wireless LANs. This work describes the benets of programmableAcc...

متن کامل

A Verification Framework for Fictitious Play Based Learning Algorithms

Distributed optimisation techniques have gained increasing attention due to fast development of autonomous robots. Many algorithms have been proposed to make optimisation more efficient. In this paper we propose a framework, which is based on probabilistic verification techniques, in order to compare the performance of various game-theoretic algorithms, in particular, fictitious play and its va...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003